Minimum Time Control of the Restricted Three-Body Problem
نویسندگان
چکیده
The minimum time control of the circular restricted three-body problem is considered. Controllability is proved on an adequate submanifold. Singularities of the extremal flow are studied by means of a stratification of the switching surface. Properties of homotopy maps in optimal control are framed in a simple case. The analysis is used to perform continuations on the two parameters of the problem: the ratio of masses and the magnitude of the control.
منابع مشابه
COMPARISON BETWEEN MINIMUM AND NEAR MINIMUM TIME OPTIMAL CONTROL OF A FLEXIBLE SLEWING SPACECRAFT
In this paper, a minimum and near-minimum time optimal control laws are developed and compared for a rigid space platform with flexible links during an orientating maneuver with large angle of rotation. The control commands are considered as typical bang-bang with multiple symmetrical switches, the time optimal control solution for the rigid-body mode is obtained as a bang-bang function and app...
متن کاملThe Exact Solution of Min-Time Optimal Control Problem in Constrained LTI Systems: A State Transition Matrix Approach
In this paper, the min-time optimal control problem is mainly investigated in the linear time invariant (LTI) continuous-time control system with a constrained input. A high order dynamical LTI system is firstly considered for this purpose. Then the Pontryagin principle and some necessary optimality conditions have been simultaneously used to solve the optimal control problem. These optimality ...
متن کاملکنترل بهینة شار حرارتی سطحی در یک جسم دوبعدی با خواص وابسته به دما
In this paper the optimal control of boundary heat flux in a 2-D solid body with an arbitrary shape is performed in order to achieve the desired temperature distribution at a given time interval. The boundary of the body is subdivided into a number of components. On each component a time-dependent heat flux is applied which is independent of the others. Since the thermophysical properties are t...
متن کاملOptimizing the Static and Dynamic Scheduling problem of Automated Guided Vehicles in Container Terminals
The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...
متن کاملNear-Minimum Time Optimal Control of Flexible Spacecraft during Slewing Maneuver
The rapid growth of space utilization requires extensive construction, and maintenance of space structures and satellites in orbit. 
This will, in turn, substantiate application of robotic systems in space. In this paper, a near-minimum-time optimal control law is developed for a rigid space platform with flexible links during an orientating maneuver with large angle of rotation. The time op...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Control and Optimization
دوره 50 شماره
صفحات -
تاریخ انتشار 2012